Extending the definition of modularity to directed graphs with overlapping communities
نویسندگان
چکیده
منابع مشابه
Extending the definition of modularity to directed graphs with overlapping communities
Complex networks topologies present interesting and surprising properties, such as community structures, which can be exploited to optimize communication, to find new efficient and context–aware routing algorithms or simply to understand the dynamics and meaning of relationships among nodes. Complex networks are gaining more and more importance as a reference model and are a powerful interpreta...
متن کاملMining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain
Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...
متن کاملClique Graphs and Overlapping Communities
It is shown how to construct a clique graph in which properties of cliques of a fixed order in a given graph are represented by vertices in a weighted graph. Various definitions and motivations for these weights are given. The detection of communities or clusters is used to illustrate how a clique graph may be exploited. In particular a benchmark network is shown where clique graphs find the ov...
متن کاملBenchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities.
Many complex networks display a mesoscopic structure with groups of nodes sharing many links with the other nodes in their group and comparatively few with nodes of different groups. This feature is known as community structure and encodes precious information about the organization and the function of the nodes. Many algorithms have been proposed but it is not yet clear how they should be test...
متن کاملExtending the Greene-Kleitman Theorem to Directed Graphs
The celebrated Dilworth theorem (Ann. of Math. 5 1 (1950), 161-166) on the decomposition of finite posets was extended by Greene and Kleitman (J. Combin. Theory Ser. A 20 (1976), 41-68). Using the Gallai-Milgram theorem (Acta Sci. Math. 2 1 (1960), 18 l-186) we prove a theorem on acyclic digraphs which contains the Greene-Kleitman theorem. The method of proof is derived from M. Saks’ elegant pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2009
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2009/03/p03024